SISO APP Searches in Lattices With Tanner Graphs
نویسندگان
چکیده
منابع مشابه
VLSI architectures for SISO-APP decoders
Very large scale integration (VLSI) design methodology and implementation complexities of high-speed, low-power soft-input soft-output (SISO) a posteriori probability (APP) decoders are considered. These decoders are used in iterative algorithms based on turbo codes and related concatenated codes and have shown significant advantage in error correction capability compared to conventional maximu...
متن کاملOn Tanner Graphs of Lattices and Codes - Information Theory, 1998. Proceedings. 1998 IEEE International Symposium on
The problem of finding a low-complexity Tanner graph for a general lattice A is studied. The problem is divided into two subproblems: 1) Finding an orthogonal sublattice A‘ of A which minimizes the complexity of the label code of the quotient group A/A’. 2) Constructing a simple Tanner graph for the label code obtained in part 1. The proposed approach for solving subproblem 2 can also be applie...
متن کاملTanner graphs for group block codes and lattices: Construction and complexity
We develop a Tanner graph (TG) construction for an Abelian group block code with arbitrary alphabets at different coordinates, an important application of which is the representation of the label code of a lattice. The construction is based on the modular linear constraints imposed on the code symbols by a set of generators for the dual code . As a necessary step toward the construction of a TG...
متن کاملWhich codes have cycle-free Tanner graphs?
If a linear block code C of length n has a Tanner graph without cycles, then maximum-likelihood soft-decision decoding of C can be achieved in time O(n). However, we show that cycle-free Tanner graphs cannot support good codes. Specifically, let C be an (n, k, d) linear code of rate R = k/n that can be represented by a Tanner graph without cycles. We prove that if R ≥ 0.5 then d ≤ 2, while if R...
متن کاملA novel soft information algorithm for closest point search in lattices with Tanner graph representations
An efficient, low-complexity, soft-information detector for multiple input multiple output channels and lattice constellations was devised, based on Tanner graph representations of lattices. Due to the coding gain associated with a lattice, structural relations exist between certain lattice points, which can be associated via an equivalence relation for detection purposes. The algorithm can gen...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Information Theory
سال: 2012
ISSN: 0018-9448,1557-9654
DOI: 10.1109/tit.2011.2178130